Boolean algebra

Results: 1241



#Item
51Modular Verification of Open Features Through Three-Valued Model Checking  Harry C. Li Brown University, USA

Modular Verification of Open Features Through Three-Valued Model Checking  Harry C. Li Brown University, USA

Add to Reading List

Source URL: web.cs.wpi.edu

Language: English - Date: 2004-05-02 20:58:40
52Piazza  Stats • • •

Piazza  Stats • • •

Add to Reading List

Source URL: cs.brown.edu

Language: English - Date: 2015-10-06 14:56:29
53Circuits for Datalog Provenance Daniel Deutch Tova Milo Tel Aviv University

Circuits for Datalog Provenance Daniel Deutch Tova Milo Tel Aviv University

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2013-12-16 04:18:28
54CONTRIBUTIONS TO GENERAL ALGEBRA 12 Pro eedings of the Vienna Conferen e, June 3{6, 1999 Verlag Johannes Heyn, Klagenfurt 2000 IMPLICATIONS OF PROPERTIES CONCERNING COMPLEMENTATION IN FINITE LATTICES

CONTRIBUTIONS TO GENERAL ALGEBRA 12 Pro eedings of the Vienna Conferen e, June 3{6, 1999 Verlag Johannes Heyn, Klagenfurt 2000 IMPLICATIONS OF PROPERTIES CONCERNING COMPLEMENTATION IN FINITE LATTICES

Add to Reading List

Source URL: www.dr-dau.net

Language: English - Date: 2016-06-19 12:14:44
55Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-11-09 10:22:02
56Preprocessing Techniques for QBFs Enrico Giunchiglia1 , Paolo Marin1 , and Massimo Narizzano1 DIST - Universit`a di Genova Viale Causa 13, 16145 Genova, Italy Abstract

Preprocessing Techniques for QBFs Enrico Giunchiglia1 , Paolo Marin1 , and Massimo Narizzano1 DIST - Universit`a di Genova Viale Causa 13, 16145 Genova, Italy Abstract

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2008-12-04 03:03:35
57Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Add to Reading List

Source URL: www.haz.ca

Language: English - Date: 2013-10-28 07:18:32
58The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.

The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2010-03-23 07:22:00
59Verification Methods for Dense and Sparse Systems of Equations ∗ S.M. Rump, Hamburg In this paper we describe verification methods for dense and large sparse systems of linear and nonlinear equations. Most of the metho

Verification Methods for Dense and Sparse Systems of Equations ∗ S.M. Rump, Hamburg In this paper we describe verification methods for dense and large sparse systems of linear and nonlinear equations. Most of the metho

Add to Reading List

Source URL: www.ti3.tu-harburg.de

Language: English - Date: 2005-11-23 04:44:10
60Worksheet on Truth Tables and Boolean Algebra September 24, Write a truth table for the logical statement ¬(P ∨ Q) =⇒ (¬P ∧ Q). Do it step by step (i.e. include columns for ¬P and P ∨ Q etc., building

Worksheet on Truth Tables and Boolean Algebra September 24, Write a truth table for the logical statement ¬(P ∨ Q) =⇒ (¬P ∧ Q). Do it step by step (i.e. include columns for ¬P and P ∨ Q etc., building

Add to Reading List

Source URL: math.colorado.edu

Language: English - Date: 2015-12-04 19:21:57